Watson-crick petri net and place-labelled petri net controlled grammar using formal language theory

formal language theory is a branch of applied discrete mathematics and theoretical computer science. a watson-crick automaton is an automaton that works on tapes which are double-stranded sequences of symbols related by watson-crick complementarity that are similar to the dna molecules. a petri net is a model of information flow in systems that provides a useful mathematical formalism for modelling concurrent systems. in this thesis, the relation between watson-crick automata and petri nets is investigated to consider the massive parallelism in watson- crick automata. thus, a new concept called watson-crick petri net is introduced. besides that, the structural properties of watson-crick petri net are found, namely a single start place, a run place and the stop transition. also, the generative power of watson-crick petri net is determined. besides using watson-crick complementarity in petri nets, a context-free grammar is also considered in this research. a petri net controlled grammar is a type of a context-free grammar equipped with petri nets, where the successful derivation of the grammar can be simulated by the sequence of occurrences of the net. the production rules of a grammar, for all variants of petri net controlled grammars that have been introduced, are associated only with transitions of a petri net. therefore, a place-labelled petri net controlled grammar is introduced in this research. the place labelling enables the parallel application of production rules in petri net controlled grammars to be considered. the effects of labelling strategies and the set of final markings, along with lower and upper bounds are chosen in order to increase the generative power of place-labelled petri net controlled grammar. besides that, the structural properties and structural subclass of place-labelled petri net controlled grammar are also found in this thesis

Place-labelled petri net controlled grammars

A place-labelled Petri net (pPN) controlled grammar is a context-free grammar equipped with a Petri net and a function which maps places of the net to the productions of the grammar. The language consists of all terminal strings that can be obtained by simultaneously applying the rules of multisets which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. In this paper, we study the generative power and structural properties of pPN-controlled grammars. We show that pPN-controlled grammars have the same generative power as matrix grammars. Moreover, we prove that for each pPN-controlled grammar, we can construct an equivalent place-labelled ordinary net controlled grammar

Place-Labeled Petri Net Controlled Grammars

A place-labeled Petri net (pPN) controlled grammar is a context-free grammar equipped with a Petri net and a function which maps places of the net to the productions of the grammar. The language consists of all terminal strings that can be obtained by simultaneously applying of the rules of multisets which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. In this paper, we study the generative power and structural properties of pPN controlled grammars. We show that pPN controlled grammars have the same generative power as matrix grammars. Moreover, we prove that for each pPN controlled grammar, we can construct an equivalent place-labeled ordinary net controlled grammar

A new variant of Petri net controlled grammars

A Petri net controlled grammar is a Petri net with respect to a context-free grammar where the successful derivations of the grammar can be simulated using the occurrence sequences of the net. In this paper, we introduce a new variant of Petri net controlled grammars, called a place-labeled Petri net controlled grammar, which is a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The language consists of all terminal strings that can be obtained by parallelly applying multisets of the rules which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. We study the effect of the different labeling strategies to the computational power and establish lower and upper bounds for the generative capacity of place- labeled Petri net controlled grammars

Closure properties of Watson-Crick Petri net

A Watson-Crick Petri net is a model that enhances a Petri net with the Watson-Crick complementarity feature adapted from DNA molecules. The transitions of a Watson-Crick Petri net are labelled with pairs of symbols, and a firing sequence of transitions of the Watson-Crick Petri net is considered as successful if and only if it produces complete double-stranded sequences of symbols. In this research, the closure properties of Watson-Crick Petri net are determined under several operations such as concatenation, union, intersection and concurrent composition. Some new definitions of the closure properties are defined. Also, the generative power of Watson-Crick Petri net languages under the closure properties are discussed by some examples and theorems. It is shown that the family of Watson-Crick Petri net languages is closed under concatenation, union, intersection and concurrent composition

State machine of place-labelled Petri net controlled grammars

A place-labelled Petri net controlled grammar is, in general, a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The languages of place-labelled Petri net controlled grammar consist of all terminal strings that can be obtained by parallel application of the rules of multisets which are the images of the sets of input places in a successful occurrence sequence of the Petri net. In this paper, we investigate the structural subclass of place-labelled Petri net controlled grammar which focus on the state machine. We also establish the generative capacity of state machine of place-labelled Petri net controlled grammars

Decision-making analysis using arduino-based Electroencephalography (EEG): an exploratory study for marketing strategy

Business technology has brought conventional marketing methods to the next level. These emerging integrated technologies has contributed to the growth and understanding of the consumer decision making process. Several studies have attempted to evaluate media content, especially on video advertising or TV commercials using various neuroimaging techniques such as the electroencephalography (EEG) device. Currently, the use of neuroscience in Malaysia’s marketing research is very limited due to its limited adoption as an emerging technology in this field. This research uncovers the neuroscientific approach, particularly through the use of an EEG device; examining consumers’ responses in terms of brain wave signals and cognition. A proposed theoretical framework on the factors affecting visual stimulus (movement, color, shape, and light) during the decision-making process by watching video advertising had been customized using two conceptual models of sensory stimulation. Ten respondents participated in the experiment to investigate the spectral changes of alpha brain wave signals detected in the occipital lobe. A 2-channel Arduino-based EEG device from Backyard Brains and Spike Recorder software was used to analyze the EEG signal through Fast Fourier Transform (FFT) method. Results obtained from the investigated population showed that there was statistically significant brain wave activity during the observation of the video advertising which demonstrated the interconnection with short-term memory through visual stimulus. Application of the neuroscience tool helped to explore consumer brain responses towards marketing stimuli with regards to the consumers’ decision-making processes. This study manifests a useful tool for neuromarketing and concludes with a discussion, together with recommendations on the way forward

Investigation with gifted students in learning physics concept based on cognitive structure

Physics concept is an understanding of natural occurrence. Physics is one of the natural science subjects that involves the study of matter and motion through space and time, along with related concepts. The concepts of physics explained everything involving the environment and human relation that happened in our daily life. Physics is one of the toughest subjects. Many students have difficulty to understand the subject properly. The factor of difficulty in learning physics concept come from many aspects, which is subject matter, materials for learning, the environment in class, and teaching style. Therefore, this study aims at investigating the main factor affecting the understanding of student performance in physics subject. This study has been done by given question paper that is designed based on taxonomy bloom. The question paper consists of 10 questions divided into three stages of taxonomy bloom, which are C1 (remembering), C2 (understanding), and C3 (applying). The test has been conducted among 17 years old students in Kolej PERMATA Insan. The result of the test has been analyzed. Based on the test that has been held, the results showed that most students did not reach the minimum mark of for the three stages in taxonomy bloom mainly stage C3 questions that apply the physics concept in daily life. The results from the test showed that physic is a tough subject to be learned

Regular languages, regular grammars and automata in splicing systems

Splicing system is known as a mathematical model that initiates the connection between the study of DNA molecules and formal language theory. In splicing systems, languages called splicing languages refer to the set of double-stranded DNA molecules that may arise from an initial set of DNA molecules in the presence of restriction enzymes and ligase. In this paper, some splicing languages resulted from their respective splicing systems are shown. Since all splicing languages are regular, languages which result from the splicing systems can be further investigated using grammars and automata in the field of formal language theory. The splicing language can be written in the form of regular languages generated by grammar. Besides that, splicing systems can be accepted by automata. In this research, two restriction enzymes are used in splicing systems namely BfuCI and NcoI

Structural subclass of place-labelled petri net controlled grammars: State machine

A place-labelled Petri net controlled grammar is, in general, a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The languages of place-labelled Petri net controlled grammar consist of all terminal strings that can be obtained by parallel application of the rules of multisets which are the images of the sets of input places in a successful occurrence sequence of the Petri net. In this paper, we investigate the structural subclasses of place-labelled Petri net controlled grammar which focus on the state machine. We also establish the generative capacity of state machine of place-labelled Petri net controlled grammars